Methods of scatter correction of X-ray projection data 1

ABSTRACT

Embodiments of the disclosure generally set forth techniques for adjusting an estimate of scattered radiation of a target object. One example method includes generating a plurality of radiographic projections, selecting a first radiographic projection and a second radiographic projection of the target object from the plurality of radiographic projections, forming first estimates of scattered radiation in the first and second radiographic projections, applying the first estimates of scattered radiation to the first and second radiographic projections to generate a modified first radiographic projection and a modified second radiographic projection, comparing the modified first and second radiographic projections to generate correction modules, and applying one of the correction modules to a first subset of the plurality of radiographic projections and another of the correction modules to a second subset of the plurality of radiographic projections.

CROSS REFERENCE TO RELATED APPLICATION

This application is a continuation-in-part of U.S. patent application Ser. No. 12/760,491, filed Apr. 14, 2010. The U.S. patent application Ser. No. 12/760,491, including any appendices or attachments thereof, is incorporated by reference herein in its entirety. The U.S. patent application Ser. No. 12/760,491 is also related to the commonly owned U.S. patent application Ser. No. 12/125,053, filed May 21, 2008.

FIELD OF INVENTION

This invention relates to the correction of the effects of scattered radiation on the x-ray radiographic projection of an object and in particular as applied to Computerized Tomography (CT).

BACKGROUND

Referring to FIGS. 1 a and 1 b, computerized tomography (CT) involves the imaging of the internal structure of an object 102 by collecting several projection images (“radiographic projections”) in a single scan operation (“scan”), and is widely used in the medical field to view the internal structure of selected portions of the human body. Typically, several two-dimensional projections are made of the object at different projection angles, and a three-dimensional representation of the object is constructed from the projections using various tomographic reconstruction methods. From the three-dimensional image, conventional axial, coronal, or sagittal CT slices through the object can be generated. The two-dimensional projections are typically created by transmitting radiation from a “point source” 105 through the object 102, which will absorb some of the radiation based on its size, density, and atomic composition, and collecting the non-absorbed radiation onto a two-dimensional imaging device, or imager 110, which comprises an array of pixel detectors (simply called “pixels”). In the typical CT system, the radiation source 105 and imaging detector 110 are mounted on a gantry 150 which rotates them around the object 102 being scanned. Such a system is shown in FIG. 1 a. A line that goes through the point radiation source 105, the center of rotation (known as the isocenter), and is perpendicular to the two-dimensional imager 110 is called the projection axis 112. The point where the projection axis hits the detector is known as the piercing point of the detector. Typically, the detector piercing point is located at or near the center of the imager in full-fan geometry (also known as centered-detector geometry). Described below is a variation called half-fan (offset-detector) geometry, wherein the detector array is offset, thus allowing for an increase in the field-of-view (FOV) with a 360 degree scan rotation.

The source's radiation emanates toward the imaging device 105 in a volume of space defined by a right-circular, elliptical, or rectangular cone having its vertex at the point source and its base at the imaging device. For this reason, the radiation is often called cone-beam (CB) radiation. Most commonly, the beam is collimated near the source into a rectangular cone or pyramid so that, when no object is present, the beam radiation only falls on the detector and not outside the detector boundaries. Generally, when no object is present within the cone, the distribution of radiation is substantially uniform on the imager. However, the distribution of the radiation may be slightly non-uniform. In any event, any non-uniformity in the distribution can be measured in a calibration step and accounted for. The projection axis may not be at the center of the imager or the center of the object. It may pass through them at arbitrary locations including very near the edge.

FIG. 1 b shows further aspects of the CT system of FIG. 1 a, including gantry 150 and controller 155. Controller 155 is coupled to radiation source 105, imaging device 110, and user interface 115. User interface 115 provides a human interface to controller 155 that enables the user to at least initiate a scan of the object, and to collect measured projection data from the imaging device. User interface 115 may be configured to present graphic representations of the measured data.

In an ideal imaging system, rays of radiation travel along respective straight-line transmission paths from the source, through the object (where they are partially absorbed), and then to respective pixel detectors without generating scattered rays that are detected. However, in real systems, when a quantum of radiation is absorbed by a portion of the object, one or more scattered rays are often generated that deviate from the transmission path of the incident radiation. These scattered rays are often received by “surrounding” detector elements that are not located on the transmission path that the initial quantum of radiation was transmitted on, thereby creating measurement errors.

The measurement errors created by scattered radiation cause artifacts and loss of spatial and contrast resolution in the radiographic projection data and the CT images produced by the radiation imaging system. The scattered radiation can also cause numerical errors in the image reconstruction algorithms (generally referred to as “CT number problems” in the art). All of the foregoing leads to image degradation.

Scattered radiation may arise from many sources. These may include: the bow-tie filter (if present), the object being scanned, an anti-scatter grid (if present), and the detector housing. One model for addressing these aforementioned scattering sources is described in U.S. patent application Ser. No. 12/125,053, filed on May 21, 2008, corresponding to patent publication number 20090290682, published Nov. 26, 2009. This application is hereby incorporated by reference in its entirety.

As indicated by both experiment and by Monte Carlo simulations, different types of objects can have different scattering properties and if they are all in the imaging field-of-view at the same time, then they must be appropriately addressed by a scatter correction method. For example, a significant amount of scatter can come from objects (e.g., supporting structures) adjacent to the actual object(s) of interest (e.g., the human body). One type of supporting structure is the patient table which is commonly made of polycarbon, a light material having a high probability of Compton interactions. It has been found that the scatter correction method described in the incorporated application may not be optimized to effectively model scatter from sources such as the patient table, due to how its shape, position, density, and material composition differ from that of the human body. As a result, scatter is underestimated for some projections, and a cupping artifact is observed in patients below the isocenter region when using the half-fan geometry with an offset detector (described and shown in FIG. 2). A method and system for estimating and correcting for scatter from multiple types of objects including the patient table is described hereinafter.

BRIEF DESCRIPTION OF THE FIGURES

FIG. 1 a is a schematic diagram of a radiation imaging system according to the prior art.

FIG. 1 b is a schematic diagram of an exemplary radiation imaging system embodiment which could be used to implement some of the inventions disclosed herein. Included is a gantry and a controller.

FIG. 2 is a transaxial view showing an exemplary configuration of the patient table with respect to the object on the table (generally the patient), the radiation source, and the detector, for two different (opposing) radiation angles as provided by rotation of the gantry about the object. The half-fan (or offset-detector) geometry is illustrated. Two projections, situated 180 degrees apart, are shown.

FIG. 3 shows an example of a CT projection with a cupping artifact 300 caused by scatter from the patient table.

FIG. 4 is a diagram showing how the influence of patient table scatter is magnified for lateral views.

FIG. 5 a shows an exemplary graph of piercing point projection values as a function of projection angle, before correction with the piercing point equalization correction.

FIG. 5 b shows an exemplary graph of piercing point projection values as a function of projection angle, after correction with the piercing point equalization correction.

FIG. 5 c shows a high level flow diagram of an exemplary piercing point method.

FIG. 5 d shows examples of caching.

FIG. 6 shows a high level flow diagram of an exemplary hybrid kernel method.

FIG. 7 is a particular instance of a graph of primary error vs projection angle near the piercing point, using the kernel algorithm with w=0.

FIG. 8 shows a transaxial view of the source-detector system with the patient table in the field-of-view.

FIG. 9 illustrates the generation of a distance-weighted table mask.

FIG. 10 illustrates the process of computing a distance from the table to the detector plane.

FIG. 11 shows an example of masks from binary and variable segmentation algorithms, for the same projection.

FIG. 12 shows an exemplary graph of estimated scatter and measured scatter signal vs. detector column, without and with analytical hybrid kernel method correction for patient table scatter.

FIG. 13 shows corrected pelvis CT slices corresponding to the uncorrected slice of FIG.3.

DETAILED DESCRIPTION

The inventive methods will be described according to embodiments addressing scattering from a scattering object adjacent to the target object or object of interest. An example thereof is a patient table which acts as a supporting structure for the object of interest. These embodiments are exemplary and not limiting. The methods and systems described herein can be applied to scattering from other objects adjacent to the object of interest.

The methods and associated systems and computer program products may be used alone or in various combinations with one another. As used herein and in the claims, the action of obtaining an item, such as an estimate of a quantity, encompasses the action of receiving the item from an outside process, computer-program product, and/or system, and the action of generating the item by the claimed process, computer-program product, or system.

The radiographic projections described herein are generated by a two-dimensional imaging device irradiated by a radiation source spaced therefrom to provide a space for the object of interest. The imaging device measures incident radiation at a plurality of pixels at corresponding locations on a two-dimensional surface, and the radiographic projection comprises a two-dimensional surface and a plurality of radiation values corresponding to a plurality of pixel locations of the imaging device. Each radiation value or amount includes a primary radiation amount representative of the radiation reaching the corresponding pixel along a direct path from the radiation source and a scattered radiation amount representative of other radiation reaching the corresponding pixel.

Exemplary method embodiments broadly comprise obtaining an estimate of a radiation amount associated with a first location of the radiographic projection, the radiation amount comprising at least one of a radiation amount emitted by the radiation source, a scattered radiation amount, or the primary radiation amount at the first location. The exemplary methods further comprise storing the estimate of the scattered radiation in a computer-readable medium.

Exemplary computer-program product embodiments broadly comprise instruction sets embodied on a computer-readable medium which, when executed by a processor of a computer system, cause the processor to implement the actions of the exemplary method embodiment. Exemplary system embodiments broadly encompass a radiation source, a two-dimensional imaging device, a processor, and a set of instructions stored on a computer-readable medium to implement actions that include the actions of the above exemplary method embodiment.

FIG. 2 shows an exemplary configuration of a patient table 200 with respect to the object 205 on the table (generally the patient), the radiation source 210, and the detector 215, for two different radiation angles as provided by rotation of the gantry about the object along a circular trajectory 212. In this example, system coordinates are defined with respect to the isocenter and the table angle. In FIG. 2, the xy plane is defined as the plane of the paper. The z axis extends out from the paper. The axes are shown in the insert: line 220 corresponds to the x-axis, line 222 corresponds to the z-axis. The angle is defined as 0 degrees when piercing point ray 220 (defined herein as a ray from x-ray source 210 perpendicularly through the isocenter line 222, hitting the detector 215 at piercing point 224) is directed perpendicularly to table surface 225, and is defined as 90 degrees or 270 degrees when incident radiation beam is directed parallel to table surface 225. Herein the direction of increasing angle will be defined as counter clockwise: i.e., 90 degrees is defined as being the leftmost source point. Detector 215 is disposed substantially opposite radiation source 210. However, in the half-fan geometry shown herein, the detector is offset from the projection axis so that one edge 230 is substantially opposite radiation source 210. The half-fan geometry illustrated herein is defined as being offset to the left. To completely define the system coordinates, the direction of detector offset must be specified. Triangles 235 and 235′ (“half-fans”) represent the fields-of-view of the projections at 90 and 270 degrees respectively.

FIG. 3 shows an example of a CT pelvis slice with cupping artifact 300 caused by scatter from the patient table. The patient table scatter artifact is most severe in situations with high scatter-to-primary ratios (SPR's) such as pelvis scans.

As shown in FIG. 4, the influence of patient table scatter is magnified for lateral views, i.e., where the radiation angle as defined above is near 90 degrees or 270 degrees. In that case, table top surface 400 is parallel or nearly parallel to x-ray beam 405, and table exit surface 410 (which is a scattering medium) is situated relatively close to detector 415, thus yielding an unobstructed path for scattered radiation to hit the detector. For the half-fan detection geometry shown, the table 420 is in the field-of-view only for projection 425 (270 degrees as defined), but not for projection 430 (90 degrees as defined).

Herein two exemplary methods are disclosed which may be applied to forming an estimate of total scattered radiation in a radiographic projection of a target object positioned near an adjacent object, for example the target object positioned on a patient table, which include a separate correction for scattering from the adjacent object. These methods can be used to estimate scattering from the sources adjacent to the target object. The first exemplary method is an empirical method that exploits the data inconsistencies between opposing projections to determine a correction factor, where the scattering is largest on opposing lateral projections (this may be known hereinafter as “Piercing Point Equalization method”). The second exemplary method is an analytically based method that uses a hybrid kernel model for the point scatter profiles (this may be known hereinafter as “Hybrid Kernel Correction method”). Also disclosed are exemplary system embodiments related to the above mentioned exemplary methods which broadly encompass: a radiation source, a two-dimensional imaging device, a processor, and a set of instructions stored on a computer-readable medium to implement actions that include the actions of the above mentioned exemplary methods.

Piercing Point Equalization

The Piercing Point Equalization method described hereinafter is applicable to estimating scattering due to sources such as the patient table. It is further applicable in general to providing a correction to other scatter estimation methods.

A piercing point on the detector of a CT system is defined as the point where a primary ray, i.e. an unscattered ray, extending from the radiation source perpendicularly through the isocenter line (the axis of rotation about which the mechanical gantry rotates, or the z-axis as defined in FIG. 2) of the CT system intersects the detector. A piercing point ray, therefore, is a primary ray which extends from the source perpendicularly through the isocenter line to the detector.

The piercing point equalization method described hereinafter is based on the assumption that, in CT acquisitions, two piercing point rays taken 180 degrees apart should produce identical measurements. However, the initial (uncorrected) piercing point measurements in the original radiographic projection may, in fact, differ since in some situations two opposing projections may not exhibit the same scatter profiles. One such situation where this may occur is when an off-center object is scanned. In this case, one radiographic projection may be taken with a larger detector-object “air gap” than the substantially opposing radiographic projection. When this happens, the two projections will contain different amounts of scatter from the object. Another case is for the half-fan or offset-detector geometry where different parts of the object are contained in each of the two substantially opposing radiographic projections. The upper portion of the object will usually be contained in a first horizontal projection while the lower portion of the object plus the patient table top that supports the object will be contained in a second horizontal projection that is substantially opposite the first horizontal projection.

Typically, the initial scatter estimates for each projection may suffer inaccuracies due to weaknesses in the first scatter estimation algorithm. This will lead to errors in the initial primary estimates, which are obtained by subtracting the respective initial scatter estimates from their respective raw data projections. Ultimately, these errors will lead to errors in the CT reconstructions. One key feature of the second scatter correction algorithm that is proposed is that, by comparing the initial primary estimates in the region of the piercing point for two substantially opposing projections, it is possible to estimate residual scatter errors in one or both of those projections. The comparison is used to yield a correction module that, in the most general sense, can be applied to any projection in the original set of raw data projections to generate the second primary estimates. In one embodiment, one correction module may be applied to a first subset of the raw data projections, and another correction module may be applied to a second subset of the raw data projections.

In an alternative embodiment, the second scatter estimates are generated by applying the correction modules to the initial scatter estimates. Then, to generate the second primary estimates, one of the second scatter estimates may be applied to a first subset of the raw data projections, and another of the second scatter estimates may be applied to the second subset of the raw data projections.

In one embodiment, the assumption is made that the difference between the higher and lower of the two opposing piercing point measurements after the first-pass scatter correction has been applied is due to scatter from a single object (e.g. the patient table) that is not modeled properly in the first pass scatter estimate of one of the projections. This error is calculated and a correction module is then applied to the projection affected by scatter from the object, e.g., a patient table. The correction module is based on taking the difference between the two opposing, or nearly/substantially opposing, piercing point primary estimates after the initial scatter correction is made (for example, according to the kernel methods disclosed in incorporated application Ser. No. 12/125,053; these kernel methods will be hereinafter termed the “standard kernel-based correction”).

FIGS. 5 a and 5 b show exemplary graphs of piercing point projection values as a function of projection angle, before (FIG. 5 a) and after (FIG. 5 b) correction with the piercing point equalization correction described below.

An embodiment of the piercing point equalization method is a delayed mode (or implementation). This is defined herein that extra processing is required after data acquisition finishes so that the viewing of the final images is delayed. This embodiment is illustrated hereinafter as applied to patient table scatter. This embodiment is straightforward to implement once a complete set of paired projections (e.g., covering 360 degrees) is available. Since scatter from the adjacent object, e.g., the table, is expected not to vary greatly from projection to projection, temporal smoothing (i.e., smoothing from one projection to the next) can be applied to the table scatter estimate to reduce noise-induced fluctuations. Assuming all projections are available, an exemplary algorithm of this method embodiment is described below and illustrated in FIG. 5 c.

-   -   (500) Apply the standard kernel-based scatter correction to all         projections.     -   (505) Define a Region of Interest (ROI) centered at the piercing         point associated with a projection i, e.g., 15×15 pixels. For         each projection i, instead of using the pixel value of the         piercing point associated with projection i, the mean value         (p_(i)) for all the pixels within that ROI is calculated. This         can be considered a first smoothing, and p_(i) can be referred         to as a smoothed piercing point measurement for projection i.     -   (510) For each projection i, find its substantially opposite         projection j. Like p_(i) discussed above, the mean value (p_(j))         is also calculated for each projection j and can be referred to         as a smoothed piercing point measurement for projection j. Then,         p_(i) and p_(j) for each pair of projection i and projection j         are compared. For example, the difference between p_(i) and         p_(j) may be determined. In one implementation, the difference         d_(i)=p_(i)−p_(j) for projection i may be recorded. The set of         d_(i) forms a difference curve d, which spans the entire 360°.     -   (515) The result from comparing p_(i) and p_(j) may be further         processed, so that the difference curve d may be smoothed. For         example, a running average of the differences between p_(i) and         p_(j) for multiple pairs of projection i and projection j may be         calculated. This can be considered a second smoothing.     -   (520) Based on the result of the smoothing operation, each         projection pair may be modified. In one implementation, at least         some of the smoothed difference (e.g., 50% of the smoothed         difference) determined in operation 515 may be subtracted from         the higher valued piercing point measurement in each projection         pair. In another implementation, both piercing point         measurements in each projection pair are adjusted based on at         least some of the smoothed difference.

Anyone skilled in art will recognize that the piercing point equalization method can be extended to “opposite ray” equalization in situations where the x-ray source does not move along an in-plane path, such as in a saddle or spiral trajectory. In these situations, the pixels used for comparison for any projection pair that is substantially opposite may not come from their respective piercing points, but from the impinging locations by an x-ray common to the pair of projections.

Another embodiment of the piercing point equalization method is a real-time/quasi-real-time implementation (or mode). Real-time is defined herein that the reconstruction process can keep up with the data acquisition rate so that, as soon as the acquisition is finished, i.e., the gantry rotation completes, the final images are available. This embodiment is illustrated hereinafter as applied to patient table scatter, but can be applied to scatter from general adjacent objects. As is the case with the earlier described delayed implementation, the piercing point correction is applied after an initial scatter correction is made, which takes into account scattering from all sources but may not be optimized for sources such as the patient table.

To apply the piercing point correction in real time, the data is taken in such a way that the first 180 degrees of projections do not contain, or only contain minimal amounts of, table scatter. The correction does not need to be actually applied before the paired projections become available. This requires, in the best case, that the gantry starts at a certain angle and rotates in a certain direction, depending on the way the detector is offset which will be described in more detail below. In clinical settings, this requirement may not be met, which necessitates delaying until paired projections are available. The real-time/quasi-real-time embodiment provides a method for implementing the necessary delaying.

A practical way to delay the carrying out of the piercing point correction while data are being acquired and reconstructed is to cache projections. A projection is called “higher scatter” if it contains substantial adjacent object (e.g., table) scatter. In certain cases, depending on how the detector is offset, the rotation direction and start angle of rotation, no opposing lower scatter projection is yet available to match the piercing point intensity. In these cases, it is necessary to wait until the opposing projection becomes available at a later point in time. During the intervening time, the unpaired “higher scatter” projections are cached either in RAM memory, or on disk. Determination of the regions of expected higher and lower scatter projections, and the resulting requirements for caching, depends on several criteria. An exemplary, though not necessarily complete, set of the criteria used to determine caching, as illustrated with table scatter is:

-   -   1. Rays which go through the table but do not pass through the         object evidence the relatively highest amount of table scatter.         If such rays pass longitudinally through the table, i.e., have         the longest relative traversal through the table, the table         scatter is maximized. The highest scatter angle, according to         this criterion, is 270 degrees as defined in FIG. 2, i.e.,         parallel to the table surface with the source to the right. This         angle is the highest scatter for a half-fan geometry with the         detector offset to the left, since, as shown in FIG. 4, the         majority of rays pass longitudinally through the table and exit         the table near to the detector. The lowest scatter angle is         correspondingly 90 degrees, since as shown in FIG. 4, for the         half fan geometry with detector offset to the left, the rays do         not pass through the table at all for 90 degrees. In an         embodiment, the 180 degrees of the circle with the lowest         scatter angle in its center is defined as the lower scatter         semicircle, whereas the 180 degrees of the circle with the         highest scatter angle at its center is defined as the higher         scatter semicircle. In the geometry of FIG. 4, the lower scatter         semicircle is 0-180 degrees, the higher scatter semicircle is         180-360 degrees. This is further illustrated in FIG. 5 d.     -   2. If rays which go through the table emerge close to the         detector, the table scatter component is further increased.     -   3. If rays go through a long path through the object before         reaching the table, there won't be as many scattered rays         reaching the table, therefore the table scatter will be somewhat         lowered. However, this scatter lowering effect is not as large         as the scatter increasing effect of a ray emerging from the         table near the detector.

The amount of caching required depends, not only on the criteria listed above, but also on the initial position of the source and detector, the direction of rotation of the gantry, and the direction of offset of the detector. Some examples are illustrated in FIG. 5 d.

-   -   1. For a gantry rotation 550 starting with the source at 270         degrees, the amount of projections required to be cached is         about ¼ of the total projections, or 90 degrees worth of         projections, whether the rotation is CW or CCW, since the first         90 degrees of projections are considered “high scatter”, and         there is no opposing projection available. The regions marked         “cached” in the figure apply for initial source position of 270         degrees, with CW rotation.     -   2. For a gantry rotation 560 starting with the source at zero         degrees, i.e., at the top, the amount of caching depends on the         direction of rotation. For CCW rotation, no caching is         necessary, since the first 180 degrees of projections are         considered “low scatter”, and when the “high scatter”         projections are reached, opposing projections are available. On         the other extreme, if the source starts at zero degrees and the         rotation is CW, a full 180 of projections are “high scatter”         without opposing projections available, and would ideally be         cached. A similar situation exists for 180 degree initial         position 565, although the directions are reversed.

Caching the projections may delay the time that the final image is reconstructed.

The time delay can be reduced by reducing the amount of projections that are cached. It is found in experimental studies that satisfactory results can still be achieved by caching less than the optimal range of projections, e.g., less than 90 degrees of projections for initial position of 90 or 270 degrees. 45 degrees of caching for 90 or 270 degree initial position has been found to give acceptable results in some cases.

Note that it is possible to cache an arbitrary number of projections, not just 45 or 90 degrees. Note also that the piercing point equalization, whether delayed or real-time, should be applied after kernel scatter correction but before the logarithm operation (described in incorporated application Ser. No. 12/125,053). Although mainly directed to table or other adjacent object scatter, the piercing point equalization method also tends to correct, or can be influenced by, any other inconsistencies such as detector gain and lag effects.

The piercing point equalization algorithm is easily implemented and is substantially blind to the particulars of the adjacent object scattering properties. Only a constant-value scatter estimate is determined for each projection. Another scattering model is an analytical model such as that described hereinafter.

Analytical Hybrid Kernel Model

The method described hereinafter is related to the kernel model described in incorporated patent application Ser. No. 12/125,053. Application Ser. No. 12/125,053 introduced asymmetric kernels to characterize scatter profiles. Asymmetric kernel modeling of the scattering profiles extended the results for estimated object scatter as compared to earlier symmetric kernel models. The symmetric and asymmetric kernel models are described in application Ser. No. 12/125,053. The symmetric kernel model is termed Convolution Mode 0, and the asymmetric kernel model is termed Convolution Mode 1. The current method modifies the existing kernels where there is a shadow from a scattering source adjacent to the object, e.g., table shadow, in each projection, to reflect the additional scatter generated by the scattering source. These modified kernels are a blend of symmetric kernels and asymmetric kernels, and are termed “hybrid kernels”. This method is illustrated hereinafter by an embodiment as applied to patient table scatter. The application to patient table scatter is not limiting: the method may be applicable to other scattering sources adjacent to the object.

For the exemplary patient table scatter embodiment, it has been found experimentally and by modeling such as Monte Carlo simulations that x-ray beams which pass mainly through the patient table and not through the target object are better modeled by a symmetric kernel, whereas beams that pass through the object are better modeled by an asymmetric kernel. This is possibly due to the differences in density, shape, and material composition between the table and the target object. For the beams passing through the patient table and the target object, a combination of symmetric and asymmetric kernels can be used. Referring back to FIG. 2, 0 degree beams have a larger asymmetric kernel contribution since most scatter is from the object, whereas 90 degree beams, i.e., lateral views, have a larger symmetric kernel contribution, since a higher proportion of scatter is from the table.

Accordingly, an embodiment of an algorithm is proposed that contains a spatially dependent mix of both symmetric and asymmetric kernels, with the mixing fraction depending on the table structure and the projection angle as follows: HybridKernel=w·Kernel_(A)+(1−w)·Kernel_(B) where Kernel_(A) is the symmetric kernel, Kernel_(B) is the asymmetric kernel, and w is a weighting factor, in an embodiment w being a function that depends on the geometry of the adjacent object, e.g., the table, and the gantry angle, and is calibrated with the aid of a slit scan as will be described.

As described in incorporated application Ser. No. 12/125,053, the incident radiation I_(I) can be modeled as an array of pencil beams. In an embodiment of the hybrid kernel model, the hybrid kernels are only applied to pencil beams that pass through the adjacent object, e.g., the table. Thus, the algorithm requires knowledge of the projected adjacent object, e.g., table, shape and its position for each view. With this knowledge, the hybrid kernel modification can be implemented substantially within the existing algorithm framework.

FIG. 6 shows a high level flow diagram of an exemplary hybrid kernel method embodiment as applied to a patient table adjacent object.

For each projection,

-   -   1) Generate a weighting factor (w(θ)) where θ is the projection         angle. (600)     -   2) Project the table onto the detector. Divide the detector area         into two regions—the region that is shadowed by the table (R1)         and the region that is not shadowed by the table (R2). (605)         Segmentation and/or variable mask may be utilized.     -   3) Within the convolution loop:         -   a. For region R2, proceed with regular asymmetric kernels             (conv1). (610)         -   b. For region R1, calculate scatter using both symmetric             (conv0) and asymmetric (conv1) kernels. The scatter             originating from R1 is given by:             scatter=w*conv0+(1−w)*conv1(615)         -   c. Sum up the scatter estimates from R1 and R2 regions to             produce the complete scatter estimate. (620)             Note that 3 a and 3 b can be rearranged during             implementation such that the conv1 is performed all together             for regions R1 and R2.             Following is a more detailed description of some of the             above method steps.             Determination of Weighting Function w (Refer to Step 600)

For each projection and each detector pixel shadowed by the table, the weighting function w defines how much of the total scatter signal is coming from the table (in some embodiments, “super-pixels” comprising multiple pixels are utilized in order to lower computation time). The weighting function specifies the fractional amplitude of the symmetric kernel relative to the total kernel amplitude. When the weight is 1, the kernel becomes completely symmetric; when it is 0, the kernel is asymmetric. The weighting function is projection-dependent and has a peak near the projection where the x-ray beam passes horizontally through the table (FIG. 2, 270° projection). In an embodiment, the weighting function is approximated as a symmetric Gaussian function

$\begin{matrix} {{{w(\theta)} = {A_{t}{\mathbb{e}}^{- \frac{{({\theta - \theta_{0}})}^{2}}{2\sigma^{2}}}}},} & (2) \end{matrix}$ where θ is the projection angle and A_(t), θ₀ and σ are parameters to be determined. The function is evaluated in the range [θ₀−180°, θ₀+180°] to ensure its continuity upon the wraparound at 360°. The weighting function depends on the type of table used, but for a given table, it has been found to be relatively independent of the scanned object shape and size.

In an embodiment, a set of experimental measurements known as slit-scan scatter measurements may be used to obtain the weighting function, i.e., to experimentally determine the weighting function for a particular patient table. The general technique used in this embodiment is to compare the existing kernel function correction with a slit-based correction which is considered to be the “gold standard” correction. Slit-based correction is described in U.S. Pat. No. 7,336,760, issued Feb. 26, 2008, which is hereby incorporated by reference in its entirety. Then, from the difference curve between the two corrections, fitting parameters may be determined for the functional form chosen for the weighting function. An exemplary weighting function determination is as follows:

A uniform elliptical phantom may be placed on the table and scanned with both wide and narrow slit beams. The wide scan may be corrected with the current kernel-based scatter correction algorithm. This is equivalent to a weighting function w=0 for all projections. The wide scan may also be corrected with the slit-based correction (scatter estimate=1.1*(wide−narrow)), which is considered to be the most accurate correction. From the slit-scan measurement, errors in the primary and scatter estimates using the standard kernel model may be determined and, from these results, a weighting function w may be generated. FIG. 7 is a particular instance of a graph of primary error versus projection angle near the piercing point, using the kernel algorithm with w=0. The error is considered to be caused by table scatter.

It is observed that the fitting parameters for the weighting function w(θ) are correlated with like parameters from the error curve of FIG. 7. For the Gaussian weighting function form of equation (2), two of the fitting parameters, θ₀ (this parameter depends on where the 0° projection is, ranges from 0 to 360) and σ, (this parameter ranges from 15 to 40 degrees, with a typical value of 25 degrees) may be measured directly or indirectly from the peak location 705 and the FWHM 710 of the peak of the error curve. The third parameter in the weighting function, A_(t), (which ranges between 0 and 1) may then be manually adjusted to minimize primary errors. In an example, the following values were found, θ₀=210°, σ=25.5°, A_(t)=0.8.

Depending on the patient table geometry, a Gaussian form for the weighting function may not be optimal. Another possible form for the weighting function is a Gamma distribution.

Segmentation (Refer to Step 605)

In an embodiment of the hybrid kernel model as applied to table scatter, the hybrid kernels are applied to the pencil beams located only within parts of the projection that are shadowed by the adjacent object, e.g., the table. Thus it is important to be able to efficiently segment the adjacent object. The segmentation process will be illustrated with a patient table, although this is exemplary and not limiting.

Although it may be possible to use image processing techniques to determine where the table shadow falls on the detector, it has been found to be more straightforward and more accurate to use a priori knowledge of the table shape and position to mathematically project the table onto the detector surface. An exemplary implementation of such a projection is as follows:

The four edges of the table are projected on the detector. For scans in which the table is uniform in its axial direction, this turns into projecting four parallel lines, or effectively four points due to the translational symmetry in the axial direction. FIG. 8 shows a transaxial view of the source-detector system with the patient table 800 in the field-of-view. Assuming the distance from the top 805 of the table to the isocenter 810 is h, and the angle 815 between the table 800 and the central ray 820 is θ, then the four corner points 821-824 of the table's cross section can be fully specified in the coordinate system defined as in FIG. 8. At θ=0, the four points are:

$\begin{matrix} \left\{ \begin{matrix} {{p_{1}:\left( {x_{1},y_{2}} \right)} = \left( {h,{d/2}} \right)} \\ {{p_{2}:\left( {x_{2},y_{2}} \right)} = \left( {{h + t},{d/2}} \right)} \\ {{p_{3}:\left( {x_{2},y_{1}} \right)} = \left( {{h + t},{{- d}/2}} \right)} \\ {{{p_{4}:\left( {x_{1},y_{1}} \right)} = \left( {h,{{- d}/2}} \right)},} \end{matrix} \right. & (3) \end{matrix}$ where t is the table thickness 830, and d is the table's lateral width 835. At an arbitrary projection angle θ, the new coordinates of these four points are calculated by a rotational operation:

$\begin{matrix} \left\{ \begin{matrix} {x^{\prime} = {{x\;{\cos(\theta)}} - {y\;{\sin(\theta)}}}} \\ {y^{\prime} = {{x\;{\sin(\theta)}} + {y\;{{\cos(\theta)}.}}}} \end{matrix} \right. & (4) \end{matrix}$ Applying Eq. (4), the new coordinates are:

$\begin{matrix} \left\{ \begin{matrix} {p_{1}^{\prime}:\left( {{h\;{\cos(\theta)}} - {{d/2}\;{\sin(\theta)}} + {{d/2}\;{\cos(\theta)}}} \right)} \\ {p_{2}^{\prime}:\left( {{{\left( {h + t} \right){\cos(\theta)}} - {{d/2}{\sin(\theta)}}},{{\left( {h + t} \right){\sin(\theta)}} + {{d/2}{\cos(\theta)}}}} \right)} \\ {p_{3}^{\prime}:\left( {{{\left( {h + t} \right){\cos(\theta)}} + {{d/2}\;{\sin(\theta)}}},{{\left( {h + t} \right){\sin(\theta)}} - {{d/2}{\cos(\theta)}}}} \right)} \\ {p_{4}^{\prime}:{\left( {{{h\;{\cos(\theta)}} + {{d/2}\;{\sin(\theta)}}},{{h\;{\sin(\theta)}} - {{d/2}{\cos(\theta)}}}} \right).}} \end{matrix} \right. & (5) \end{matrix}$ New points p′₁, p′₂, p′₃ and p′₄ can then be projected onto the detector plane (defined to be in the x-plane) according to the following equation:

$\begin{matrix} {{x_{p} = {x \cdot \frac{SDD}{{SAD} + y}}},} & (6) \end{matrix}$

where SDD is the Source-to-Detector Distance and SAD is the Source-to-Isocenter (Axis) Distance. The units of Eq. (6) can be expressed in terms of the detector pixel index (or detector column index) as

$\begin{matrix} {{X_{p} = \frac{\left( {x_{p} - x_{0}} \right)}{pixelsize}},} & (7) \end{matrix}$ where x₀ is the x coordinate of the first detector column Note that the pixel index Xp may or may not be located within the actual detector matrix, so an intersection operation may be required.

After the four points are rotated and projected to the detector 840, the table shadow on the detector plane is defined. It is the area between two vertical lines passing through the leftmost and the rightmost points, with its width equal to the maximum separation among these four projected points. The part of the shadow that is actually seen by the detector is the intersection of the projected shadow and the detector area, that is, the starting and the ending column of the table shade are given by:

$\begin{matrix} \left\{ \begin{matrix} {X_{1} = {\max\left( {{\min\left( {X_{p\; 1},X_{p\; 2},X_{p\; 3},X_{p\; 4}} \right)},1} \right)}} \\ {{X_{2} = {\min\left( {{\max\left( {X_{p\; 1},X_{p\; 2},X_{p\; 3},X_{p\; 4}} \right)},{NSizeX}} \right)}},} \end{matrix} \right. & (8) \end{matrix}$ when the shadow does intersect with the detector. In this implementation, the table shadow or table mask is a binary 2-D map having values 1 and 0 for unshaded and shaded regions respectively.

Actual patient tables may not have exact rectangular cross sections. One possible alternate cross section is a trapezoidal cross section, which may be treated with the aforementioned scheme by adapting the coordinates for the table edges in Eq. 3. Alternately, a slightly non-rectangular cross section table may be approximated with a rectangular cross section, with its height equal to the maximum table thickness and width equal to the maximum table width.

For other table configurations, the thickness is not uniform axially. The table segmentation method is found to be robust even if the table thickness is overestimated. This is because, in areas where the table is assumed to be thicker than it actually is, the scatter kernel value will be 0 since the data measurements match the air measurements. An important datum is the knowledge of h, which is the distance from the top of the table to the isocenter, thus defining the boundary of the table top and the scanned object in the projection data.

Variable Mask (Refer to Step 605)

Further refinements to the segmentation method have been developed, which include allowing the adjacent object shadow, e.g., the table shadow or mask, to be variable, rather than binary as in the above-described exemplary segmentation implementation. This may improve estimation of the adjacent object scatter profile. The variable mask method is illustrated using a patient table, but this is exemplary and not limiting.

The exemplary analytical table scatter correction algorithm as has been disclosed has two main components—the weighting function and the table mask. The weighting function is a scalar function and the table mask, corresponding to the detector area shaded by the table, is a binary 2-D map having values 1 and 0 for the regions R1 and R2, respectively. The two combine to act as a pre-weighting step in the hybrid kernel model: S(x, y)=(M _(edge)(x, y)·w·M _(table)(x, y)·A(I _(p)(x, y), I ₀(x, y))){circle around (×)}h _(sym)+(M _(edge)(x, y)·(1−w·M _(table)(x, y))·A(I _(p)(x, y),I ₀(x, y)){circle around (×)}h _(asym),   (12) where M_(edge) is the edge response mask, A is the amplitude part of the scatter kernel (a function of both the primary and the I₀ signal, as described in incorporated patent application Ser. No. 12/125,053, w is the weighting function and M_(table) is the table mask resulting from table segmentation.

In the refinement, instead of a binary map, the table mask may be made variable. This means that each pencil beam passing through the table is allowed to have a different ratio of the symmetric to asymmetric kernel component. The hypothesis behind this approach is that a pencil beam that goes through the table closer to the detector may produce more symmetric scatter than a pencil beam that intersects the table further away from the detector, since it travels less distance in which scattered rays from the table may be attenuated.

The actual dependence of the table map on the table-to-detector distance is expected to be a complex function that would require extensive research to determine. Herein discloses an exemplary estimate based on first principles. The assumption is first made that the table mask intensity value should be inversely proportional the table-to-detector distance. The dependence is then adjusted based upon the scatter error remaining after correction.

To generate the exemplary distance-dependent table mask, the table-to-detector distance is computed for all pencil beams. For rays cutting through the table, the thickness of the table along the ray can be significant compared to the table-to-detector distance. Thus, the table-to-detector distance has ambiguities among the pencil beams. Because most table scatter comes from the table outer region, in this approximation the table-to-detector distance is calculated using the exit point for the table, although more complicated models could also be used.

Referring back to FIG. 8, after calculating the coordinates of the four table corners p′_(i) and their projected locations x_(pi)(i=1 . . . 4) on the detector, the table-to-detector distances are readily calculable. Note that in some cases, the projected corner may extend beyond the boundary of the physical detector. This corner would not be irradiated and it is used only as a reference point. To include all reference points, a virtual detector may be created which is big enough to include all corners of the table for all projections. The virtual detector used in this exemplary implementation is 200 cm wide and centered so it spans a range from −1000 mm to +1000 mm, with pixel index running from 1 to 2000 (pitch of 1 mm)

FIG. 9 illustrates an exemplary generation of a distance-weighted table mask. Shown is the transaxial view of the table 900 with one of its surfaces 905 projected onto the virtual detector 910. The distance from table surface 905 to detector 910 is approximated as a linearly varying function having boundary values of d₂ and d₃ at endpoints x_(p2) and x_(p3). For a given projection, the two exit corners (p′₂ and p′₃) project to points x_(p2) and x_(p3) on the virtual detector with corresponding distances of d₂ and d₃ to the table. Note that the distances d₂ and d₃ are defined as the shortest geometrical distance from the table exit point to the detector. Then, for any ray falling between p′₂ and p′₃, a distance estimate can be linearly interpolated. The linear interpolation method is only an approximation, since for a divergent beam the distance between two straight lines varies nonlinearly. Nevertheless, this approximation is expected to be sufficiently accurate for a first estimate. The linearly interpolated distance is computed as follows:

$\begin{matrix} {{{r_{ab}(x)} = {d_{a} + {\left( {d_{b} - d_{a}} \right)\;\frac{x - x_{pa}}{x_{pb} - x_{pa}}}}},} & (13) \end{matrix}$ where the subscripts a and b refer to two corner rays (in this case 2 and 3).

FIG. 10 illustrates an exemplary process of computing a distance from the table to the detector plane. The distance to the detector using a pair of table corners as a reference is first calculated, and all permutations of table corners are used. (The final table-to-detector distance is defined as the shortest distance to the detector.) After this occurs, the virtual detector is clipped to the actual detector size and resampled to determine the final distance value for each super pixel.

Once a distance map r(x,y) is obtained, the table mask may be built using the formula

$\begin{matrix} {{{M_{table}\left( {x,y} \right)} = {k\left( \frac{DAD}{r\left( {x,y} \right)} \right)}^{q}},} & (14) \end{matrix}$

where DAD is the detector-to-axis distance, and k, q are user-determined tuning parameters. It is found that k=1 and q=1 give reasonable results.

FIG. 11 shows an example of masks from binary (1100) and variable (1105) segmentation algorithms, for the same projection.

Results

FIG. 12 shows an exemplary graph of estimated scatter and measured scatter signal vs. detector column, with (1200, 1205) and without (1210, 1215) analytical hybrid kernel method correction for patient table scatter. Upper curves 1220, 1225 are total signal, i.e., primary+scatter. It is seen that, with the patient table correction, the estimated scatter curve is quite close to the measured curve.

FIG. 13 shows corrected pelvis CT slices corresponding to the uncorrected slice of FIG. 3. Slice 1300 is corrected using piercing point equalization, slice 1305 is corrected using the analytical hybrid kernel model with a binary table mask. In this example, the analytical correction gives an overall flatter image, measured as 40 HU (Hounsfield Units) in the area below the isocenter.

System and Computer Program Product Embodiments. Each of the above-described methods may be implemented by computer program products that direct a computer system to perform the actions of the methods. Each such computer program product may comprise sets of instructions embodied on a tangible computer-readable medium that direct the processor of a computer system to perform the corresponding actions. Examples of such computer-readable mediums are the instruction memory shown for controller 155 in FIG. 1 b. The instructions may be in executable computer code (such as C, C++), human-readable code (such as MatLab Code), and the like. Other types of tangible computer-readable media include floppy disks, removable hard disks, optical storage media such as CD-ROMS, DVDs and bar codes, semiconductor memories such as flash memories, read-only-memories (ROMS), battery-backed volatile memories, networked storage devices, and the like. Given the above-detailed description of the various method embodiments of the inventions of the present application, it is within the skill of one of ordinary skill in the tomography art to implement each of the method embodiments disclosed herein in a computer program product without undue experimentation. Such computer program product may be run on processor 155 shown in FIG. 1 b, or on separate processors that are not coupled to Cone-beam Computer Tomography Systems.

Exemplary systems of the present application may comprise radiation source 105, imaging device 110, and controller 155, in combination with various computer program products and/or methods of the present application.

Any recitation of “a”, “an”, and “the” is intended to mean one or more unless specifically indicated to the contrary.

The terms and expressions which have been employed herein are used as terms of description and not of limitation, and there is no intention in the use of such terms and expressions of excluding equivalents of the features shown and described, it being recognized that various modifications are possible within the scope of the invention claimed.

Moreover, one or more features of one or more embodiments may be combined with one or more features of other embodiments without departing from the scope of the invention.

While the present invention has been particularly described with respect to the illustrated embodiments, it will be appreciated that various alterations, modifications, adaptations, and equivalent arrangements may be made based on the present disclosure, and are intended to be within the scope of the invention and the appended claims. 

The invention claimed is:
 1. A method to adjust an estimate of scattered radiation of a target object, comprising: a) generating a plurality of radiographic projections; b) selecting a first radiographic projection and a second radiographic projection of the target object from the plurality of radiographic projections; c) forming first estimates of scattered radiation in the first and second radiographic projections; d) applying the first estimates of scattered radiation to the first and second radiographic projections to generate a modified first radiographic projection and a modified second radiographic projection; e) comparing the modified first and second radiographic projections to generate correction modules; and f) applying one of the correction modules to a first subset of the plurality of radiographic projections and another of the correction modules to a second subset of the plurality of radiographic projections.
 2. The method of claim 1, wherein f) further comprises generating second estimates of scattered radiation based on the correction modules and the first estimates of scattered radiation, applying one of the second estimates of scattered radiation to the first subset of the plurality of radiographic projections, and applying another of the second estimates of scattered radiation to the second subset of the plurality of radiographic projections.
 3. The method of claim 1, wherein the first radiographic projection is substantially opposite the second radiographic projection.
 4. The method of claim 1, wherein e) further comprises comparing a first mean value for pixels in a first Region of Interest (ROI) near a first piercing point with a corresponding second mean value for pixels in a second ROI near a second piercing point, wherein the first piercing point is associated with the first radiographic projection, the second piercing point is associated with the second radiographic projection.
 5. The method of claim 4, further comprises determining a first difference between the first mean value and the second mean value, and modifying the modified first and second radiographic projections based on at least some of the first difference.
 6. The method of claim 4, further comprises selecting a third radiographic projection and a fourth radiographic projection of the target object from the plurality of radiographic projections, comparing a third mean value for pixels in the first ROI near a third piercing point with a corresponding fourth mean value for pixels in the second ROI near a fourth piercing point, wherein the third piercing point is associated with the third radiographic projection, the fourth piercing point is associated with the fourth radiographic projection, determining a second difference between the third mean value and the fourth mean value, determining an averaged difference based on the first difference and the second difference, and modifying the modified first and second radiographic projections based on at least some of the averaged difference.
 7. The method of claim 6, wherein the first radiographic projection is substantially opposite the second radiographic projection, and the third radiographic projection is substantially opposite the fourth radiographic projection.
 8. The method of claim 1, wherein the correction modules contain information about scattered radiation from an adjacent object that is at least partially adjacent to the target object.
 9. The method of claim 1, wherein the first radiographic projection of the target object is selected from a first angular range of radiographic projections and the second radiographic projections of the target object is selected from a second angular range of radiographic projections, the first angular range is substantially opposite of the second angular range, and the comparison of the modified first radiographic projection and the modified second radiographic projection is delayed for a delay period until at least one radiographic projection of the first angular range of radiographic projections having a corresponding radiographic projection in the second angular range of radiographic projections is collected.
 10. The method of claim 9, wherein during the delay period, the second angular range of radiographic projections is cached in a computer readable medium, yielding an angular range of cached radiographic projections.
 11. The method of claim 10, wherein the generating of radiographic projections is started at a start angle chosen to minimize the angular range of cached radiographic projections.
 12. The method of claim 10, wherein the angular range of cached projections comprises at most 90 degrees.
 13. The method of claim 8, wherein the adjacent object differs from the target object in at least one of density and material composition.
 14. The method of claim 8, wherein the adjacent object is a support structure for the target object.
 15. The method of claim 14, wherein the adjacent object is a patient table top.
 16. The method of claim 15, wherein the patient table top comprises a carbon fiber skin layer.
 17. The method of claim 1, wherein the plurality of radiographic projections are formed from a radiation source onto a detector, the radiographic projections having a projection axis, the detector being offset from the projection axis.
 18. The method of claim 1, wherein the plurality of radiographic projections comprise a set of radiographic projections taken at a range of angles.
 19. The method of claim 18, wherein the plurality of radiographic projections comprise: a fifth subset of radiographic projections consisting of paired projections, a paired projection being a radiographic projection and its substantially opposing radiographic projection; and a sixth subset of radiographic projections consisting of unpaired projections.
 20. The method of claim 19, wherein the sixth subset of radiographic projections comprises: a seventh subset of radiographic projections containing substantial scatter from the adjacent object; and an eighth subset of radiographic projections containing minimal scatter from the adjacent object.
 21. The method of claim 20, wherein radiographic projections in the seventh subset of radiographic projections are cached until substantially opposing projections to the radiographic projections become available.
 22. The method of claim 21, wherein substantially opposing projections to all radiographic projections in the seventh subset of radiographic projections are available, and no radiographic projections is cached.
 23. A non-transitory computer readable medium containing a sequence of instructions for adjusting an estimate of scattered radiation of a target object, which in response to execution by a processor of a computer system, cause the computer system to: a) generate a plurality of radiographic projections; b) select a first radiographic projection and a second radiographic projection of the target object from the plurality of radiographic projections; c) form first estimates of scattered radiation in the first and second radiographic projections; d) apply the first estimates of scattered radiation to the first and second radiographic projections to generate a modified first radiographic projection and a modified second radiographic projection; e) compare the modified first and second radiographic projections to generate correction modules; and f) apply one of the correction modules to a first subset of the plurality of radiographic projections and another of the correction modules to a second subset of the plurality of radiographic projections.
 24. The non-transitory computer readable medium of claim 23, further containing a sequence of instructions for f), which in response to execution by the processor, causes the computer system to: generate second estimates of scattered radiation based on the correction modules and the first estimates of scattered radiation; apply one of the second estimates of scattered radiation to the first subset of the plurality of radiographic projections; and apply another of the second estimates of scattered radiation to the second subset of the plurality of radiographic projections.
 25. The non-transitory computer readable medium of claim 23, wherein the first radiographic projection is substantially opposite the second radiographic projection.
 26. The non-transitory computer readable medium of claim 23, further containing a sequence of instructions for e), which in response to execution by the processor, causes the computer system to: compare a first mean value for pixels in a first Region of Interest (ROI) near a first piercing point with a corresponding second mean value for pixels in a second ROI near a second piercing point, wherein the first piercing point is associated with the first radiographic projection, the second piercing point is associated with the second radiographic projection.
 27. The non-transitory computer readable medium of claim 26, further containing a sequence of instructions, which in response to execution by the processor, causes the computer system to: determine a first difference between the first mean value and the second mean value; and modify the modified first and second radiographic projections based on at least some of the first difference.
 28. The non-transitory computer readable medium of claim 26, further containing a sequence of instructions, which in response to execution by the processor, causes the computer system to: select a third radiographic projection and a fourth radiographic projection of the target object from the plurality of radiographic projections; compare a third mean value for pixels in the first ROI near a third piercing point with a corresponding fourth mean value for pixels in the second ROI near a fourth piercing point; wherein the third piercing point is associated with the third radiographic projection, the fourth piercing point is associated with the fourth radiographic projection; determine a second difference between the third mean value and the fourth mean value; determine an averaged difference based on the first difference and the second difference; and modify the modified first and second radiographic projections based on at least some of the averaged difference.
 29. The non-transitory computer readable medium of claim 28, wherein the first radiographic projection is substantially opposite the second radiographic projection, and the third radiographic projection is substantially opposite the fourth radiographic projection.
 30. The non-transitory computer readable medium of claim 23, wherein the correction modules contain information about scattered radiation from an adjacent object that is at least partially adjacent to the target object.
 31. The non-transitory computer readable medium of claim 23, wherein the first radiographic projection of the target object is selected from a first angular range of radiographic projections and the second radiographic projections of the target object is selected from a second angular range of radiographic projections, the first angular range is substantially opposite of the second angular range, and the comparison of the modified first radiographic projection and the modified second radiographic projection is delayed for a delay period until at least one radiographic projection of the first angular range of radiographic projections having a corresponding radiographic projection in the second angular range of radiographic projections is collected.
 32. The non-transitory computer readable medium of claim 31, wherein during the delay period, the second angular range of radiographic projections is cached in a computer readable medium, yielding an angular range of cached radiographic projections.
 33. The non-transitory computer readable medium of claim 32, wherein the generating of radiographic projections is started at a start angle chosen to minimize the angular range of cached radiographic projections.
 34. The non-transitory computer readable medium of claim 32, wherein the angular range of cached projections comprises at most 90 degrees.
 35. The non-transitory computer readable medium of claim 30, wherein the adjacent object differs from the target object in at least one of density and material composition.
 36. The non-transitory computer readable medium of claim 30, wherein the adjacent object is a support structure for the target object.
 37. The non-transitory computer readable medium of claim 23, wherein the plurality of radiographic projections are formed from a radiation source onto a detector, the radiographic projections having a projection axis, the detector being offset from the projection axis.
 38. The non-transitory computer readable medium of claim 23, wherein the plurality of radiographic projections comprise a set of radiographic projections taken at a range of angles.
 39. The non-transitory computer readable medium of claim 38, wherein the plurality of radiographic projections comprise: a fifth subset of radiographic projections consisting of paired projections, a paired projection being a radiographic projection and its substantially opposing radiographic projection; and a sixth subset of radiographic projections consisting of unpaired projections.
 40. The non-transitory computer readable medium of claim 39, wherein the sixth subset of radiographic projections comprises: a seventh subset of radiographic projections containing substantial scatter from the adjacent object; and an eighth subset of radiographic projections containing minimal scatter from the adjacent object.
 41. The non-transitory computer readable medium of claim 40, wherein radiographic projections in the third subset of radiographic projections are cached until substantially opposing projections to the radiographic projections become available.
 42. The non-transitory computer readable medium of claim 41, wherein substantially opposing projections to all radiographic projections in the seventh subset of radiographic projections are available, and no radiographic projections is cached.
 43. A method to form an adjusted estimate of scattered radiation in an initial radiographic projection of a target object, comprising: generating at least two secondary radiographic projections of said target object; forming a first estimate of scattered radiation based on said initial radiographic projection in each of said at least two secondary radiographic projections of said target object, wherein said initial radiographic projection can be one of said secondary radiographic projections; applying said first estimate of scattered radiation in each of said at least two secondary radiographic projections of said target object to yield at least two corrected secondary radiographic projections of said target object; comparing said at least two said corrected secondary radiographic projections of said target object to detect an error in said first estimate of scattered radiation in said at least two secondary radiographic projections; and forming a correction module and applying said correction module to said first estimate of scattered radiation in said initial radiographic projection to form an adjusted estimate of scattered radiation in said initial radiographic projection, said correction module being derived from said comparing said at least two said corrected secondary radiographic projections. 